Mobile
Log In Sign Up
Home > chinese-english > "suffix tree" in English

English translation for "suffix tree"

后缀树

Related Translations:
suffix:  n.词尾;附加器[物];【数学】下标;添标,尾标。vt.加…作后缀;把…附在后头。 a dummy suffix 【物理学】傀标。adj.-al
operators suffix:  指示灯号
suffix experiment:  反缀实验
suffix letter:  字尾字母
dummy suffix:  哑下标
suffix symbol:  后缀符
dimension suffix:  维后缀维数后缀
suffixing languages:  后缀语
suffix truncation:  后缀截去
terminal suffix:  终端后缀终结后缀
Example Sentences:
1.According to different storage methods of child suffix tree , we introduce several searching technology
根据不同的子后缀树存储方法,本文介绍了多种搜索方法。
2.This index is based on suffix tree , and is divided into some layers . a layer usually includes some child suffix trees
分层索引结构是基于后缀树的,它由若干层组成,通常情况下,每一层又包括若干棵子后缀树。
3.The construction algorithm embodies three parts that are suffix sorting , logest common prefix evaluation process and child suffix tree construction
整个建立算法包括三个部分:后缀排序,计算最短公共前缀和建立子后缀树。
4.The second part includes the index of child suffix tree , and some other information for finding the location of every child suffix tree in disk quickly
第二部分是索引部分,包括子后缀树的索引和其他信息。利用这部分信息,可以快速定位每棵子后缀树在磁盘中的位置。
5.The storage of index is divided into two parts . the first part is the information of each child suffix tree . child suffix tree can be represented by several methods which require different storage space
在存储策略上,本文把整个索引划分为两部分:第一部分保存子后缀树的信息,子后缀树可以采用多种不同的优化方法存储,每种方法所需的存储空间和性能均不相同。
6.The sequences are transformed to a relative sequence , in which all the segments are normalized by the previous segment . the relative sequences are categorized and indexed by suffix tree , and the result of the suffix tree search is the potential similar subsequences
通过将序列变换为相对序列,实现了对序列中任意位置、任意长度子序列的规范化;为了提高查询效率,将相对序列的特征向量进行离散化分类,并使用后缀树进行索引。
7.Suffix tree is a good index structure for smaller sequences , but it not suit large sequences , due to the so - called “ memory bottleneck ” . the suffix array is the closest competing structure , as it needs less space than a suffix tree . however , it is not convenient for searching
对于较小的序列来说,后缀树索引无疑是一种很好的解决办法,但由于它产生了“内存瓶颈” ,不适合大的序列;后缀数组是另一种最具有竞争力的索引结构,与后缀树相比,它需更少的存储空间,但在数据搜索方面却效率较低;基于q - gram和q - sample的索引方法虽然能用于快速搜索,但是不能用于搜索相似度低的数据。
Similar Words:
"suffix operation flag" English translation, "suffix operator" English translation, "suffix partition" English translation, "suffix signal" English translation, "suffix symbol" English translation, "suffix truncation" English translation, "suffix v" English translation, "suffix-free grammar" English translation, "suffixal" English translation, "suffixation" English translation